Howmodular structure can simplify tasks on networks : parameterizing graph optimization by fast local community detection Binh - Minh Bui - Xuan 1 and Nick S . Jones 2 1 Laboratoire d ’ Informatique
نویسنده
چکیده
By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2n), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as a preprocessing, this work gives support to the project of developing heuristic algorithms for detecting dense regions in networks: preprocessing of this kind can accelerate optimization tasks on networks. Our work also suggests a class of empirical conjectures for how structural features of efficient networked systems might scale with system size.
منابع مشابه
Howmodular structure can simplify tasks on networks : parameterizing graph optimization by fast local community detection Binh - Minh Bui - Xuan 1 and Nick
By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2n), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as...
متن کاملHowmodular structure can simplify tasks on networks : parameterizing graph optimization by fast local community detection Binh - Minh Bui - Xuan 1 and
By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2n), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as...
متن کاملHow modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection
By considering the task of finding the shortest walk through a Network, we find an algorithm for which the run time is not as O(2 n ), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection ...
متن کاملHow modular structure can simplify tasks on networks
By considering the task of finding the shortest walk through a network we find an algorithm for which the run time is not as O(2n), with n being the number of nodes, but instead scales with the number of nodes in a coarsened network. This coarsened network has a number of nodes related to the number of dense regions in the original graph. Since we exploit a form of local community detection as ...
متن کامل